VNS-BASED ALGORITHMS FOR THE CENTROID-BASED CLUSTERING PROBLEM
نویسندگان
چکیده
منابع مشابه
Density-Based Centroid Approximation for Initializing Iterative Clustering Algorithms
We present KDI (Kernel Density Initialization), a density-based procedure for approximating centroids for the initialization step of iteration-based clustering algorithms. We show empirically that a rather low number of distance calculations in conjunction with a fast algorithm for nding the highest peaks are suucient for eeectively and eeciently nding a pre-speciied number of good centroids, w...
متن کاملGoal Clustering: VNS based heuristics
Given a set V of n elements on m attributes, we want to find a partition of V on the minimum number of clusters such that the associated R-squared ratio is at least a given threshold. We denote this problem as Goal Clustering (GC). This problem represents a new perspective, characterizing a different methodology within unsupervised non-hierarchical clustering. In effect, while in the k -means w...
متن کاملA VNS-based quartet algorithm for biomedical literature clustering
A variable neighborhood search approach to the exploration of an online social network Vera Kovačević Vujčić, Mirjana Čangalović and Jozef Kratica Using VNS for the optimal synthesis of the communication tree in wireless sensor networks Adil Erzin, Roman V. Plotnikov
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولNovel centroid selection approaches for KMeans-clustering based recommender systems
Recommender systems have the ability to filter unseen information for predicting whether a particular user would prefer a given item when making a choice. Over the years, this process has been dependent on robust applications of data mining and machine learning techniques, which are known to have scalability issues when being applied for recommender systems. In this paper, we propose a k-means ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Facta Universitatis, Series: Mathematics and Informatics
سال: 2019
ISSN: 2406-047X,0352-9665
DOI: 10.22190/fumi1905957r